A New Approach for Solving Type-2 Fuzzy Shortest Path Problem
نویسندگان
چکیده
Abstract. In a network the arc lengths may represent time or cost. In practical situations, it is reasonable to assume that each arc length is a type-2 discrete fuzzy set. We called it the type-2 discrete fuzzy shortest path problem. In this paper we proposed an algorithm for finding shortest path and shortest path length from source node to destination node using type reduction method. We have compared our result with other measures like Hamming, Normalized Hamming, Exponential type distance measure also. An illustrative example also included to demonstrate our proposed approach.
منابع مشابه
Solving Critical Path Problem in Project Network by a New Enhanced Multi-objective Optimization of Simple Ratio Analysis Approach with Interval Type-2 Fuzzy Sets
Decision making is an important issue in business and project management that assists finding the optimal alternative from a number of feasible alternatives. Decision making requires adequate consideration of uncertainty in projects. In this paper, in order to address uncertainty of project environments, interval type-2 fuzzy sets (IT2FSs) are used. In other words, the rating of each alternativ...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملA New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
متن کاملSOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS
Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...
متن کاملCockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...
متن کامل